Solving the Delay-Constrained Least-Cost routing problem using Tabu Search with Edge Betweenness

Multicast routing consists of concurrently sending the same information from a source to subset all possible destinations in computer network thus becomes an important technology communication. To solve problem, current approach for efficiently supporting multicast session establishing tree that covers and terminal nodes. This problem can be reduced minimal Steiner (MST) which aims look set nodes with minimum total cost, is NP-hard. In this paper, we investigate metaheuristics approaches Delay-Constrained Least-Cost (DCLC) propose novel algorithm based on Tabu Search procedure Edge Betweenness (EB). The EB heuristic used first improve KMB heuristic, able measure edge value being included given path. obtained solution improved using tabu search method. performance proposed evaluated by experiments number benchmark instances library. Experimental results show metaheuristic gives competitive terms cost delay compared optimal library other existing algorithms literature.